Golden Ratio Sequences for Low-Discrepancy Sampling
نویسندگان
چکیده
منابع مشابه
Golden Ratio Sequences for Low-Discrepancy Sampling
Most classical constructions of low-discrepancy point sets are based on generalizations of the one-dimensional binary van der Corput sequence whose implementation requires non-trivial bit-operations. As an alternative we introduce the quasi-regular golden ratio sequences which are based on the fractional part of successive integer multiples of the golden ratio. By leveraging results from number...
متن کاملDeclustering Using Golden Ratio Sequences
In this paper we propose a new data declustering scheme for range queries. Our scheme is based on Golden Ratio Sequences (GRS), which have found applications in broadcast disks, hashing, packet routing, etc. We show by analysis and simulation that GRS is nearly the best possible scheme for 2-dimensional range queries. Speciically, it is the best possible scheme when the number of disks (M) is a...
متن کاملDiscrete Low-Discrepancy Sequences
Holroyd and Propp used Hall’s marriage theorem to show that, given a probability distribution π on a finite set S, there exists an infinite sequence s1, s2, . . . in S such that for all integers k ≥ 1 and all s in S, the number of i in [1, k] with si = s differs from k π(s) by at most 1. We prove a generalization of this result using a simple explicit algorithm. A special case of this algorithm...
متن کاملLow discrepancy holographic image sampling
Self-similar progressive image sampling schemes that have been recently proposed for holographic image representations are shown to generate two-dimensional low discrepancy sequences. The discrepancy of a planar set of points is a measure of the uniformity of their placement in the plane. Sequences, or planar sets of points with low discrepancy, cover the image domain as uniformly as possible. ...
متن کاملOn Atanassov's methods for discrepancy bounds of low-discrepancy sequences
The aim of this survey paper is to give an updated overview of results on low discrepancy sequences obtained via Atanassov’s methods. These methods first initiated for Halton sequences have been later on extended to generalizations of these sequences and to (t, s)sequences, the other well known family of low discrepancy sequences, including polynomial arithmetic analogues of Halton sequences.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graphics Tools
سال: 2012
ISSN: 2165-347X,2165-3488
DOI: 10.1080/2165347x.2012.679555